Pointwise convergence of multiple ergodic averages and strictly ergodic models

By building some suitable strictly ergodic models, we prove that for an ergodic system $(X,\mathcal{X},\mu, T)$, $d\in{\mathbb N}$, $f_1, \ldots, f_d \in L^{\infty}(\mu)$, the averages $$\frac{1}{N^2} \sum_{(n,m)\in [0,N-1]^2} f_1(T^nx)f_2(T^{n+m}x)\ldots f_d(T^{n+(d-1)m}x)$$ converge $\mu$ a.e. Deriving some results from the construction, for distal systems we answer positively the question if the multiple ergodic averages converge a.e. That is, we show that if $(X,\mathcal{X},\mu, T)$ is an ergodic distal system, and $f_1, \ldots, f_d \in L^{\infty}(\mu)$, then multiple ergodic averages $$\frac 1 N\sum_{n=0}^{N-1}f_1(T^nx)\ldots f_d(T^{dn}x)$$ converge $\mu$ a.e.Comment: 35 pages, revised version following referees' report

DNA sequences classification and computation scheme based on the symmetry principle

The DNA sequences containing multifarious novel symmetrical structure frequently play crucial role in how genomes work. Here we present a new scheme for understanding the structural features and potential mathematical rules of symmetrical DNA sequences using a method containing stepwise classification and recursive computation. By defining the symmetry of DNA sequences, we classify all sequences and conclude a series of recursive equations for computing the quantity of all classes of sequences existing theoretically; moreover, the symmetries of the typical sequences at different levels are analyzed. The classification and quantitative relation demonstrate that DNA sequences have recursive and nested properties. The scheme may help us better discuss the formation and the growth mechanism of DNA sequences because it has a capability of educing the information about structure and quantity of longer sequences according to that of shorter sequences by some recursive rules. Our scheme may provide a new stepping stone to the theoretical characterization, as well as structural analysis, of DNA sequences